Small weight codewords in the codes arising from Desarguesian projective planes

نویسندگان

  • Veerle Fack
  • Szabolcs L. Fancsali
  • Leo Storme
  • Geertrui Van de Voorde
  • Joost Winne
چکیده

We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p+ (p− 1)/2 if p ≥ 11. We then study the codes arising from PG(2, q = q 0). In particular, for q0 = p prime, p ≥ 7, we prove that the codes have no codewords with weight in the interval [q+2, 2q−1]. Finally, for the codes of PG(2, q), q = p, p prime, h ≥ 4, we present a discrete spectrum for the weights of codewords with weights in the interval [q + 2, 2q − 1]. In particular, we exclude all weights in the interval [3q/2, 2q − 1]. ∗This author’s research is supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen). †Supported by the Fund for Scientific Research Flanders (Belgium).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the code generated by the incidence matrix of points and hyperplanes in PG(n, q) and its dual

In this paper, we study the p-ary linear code C(PG(n, q)), q = p, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also lo...

متن کامل

An upper bound for the minimum weight of the dual codes of desarguesian planes

We show that a construction described in Clark, Key and de Resmini [9] of small-weight words in the dual codes of finite translation planes can be extended so that it applies to projective and affine desarguesian planes of any order p where p is a prime, and m ≥ 1. This gives words of weight 2p + 1 − p −1 p−1 in the dual of the p-ary code of the desarguesian plane of order p, and provides an im...

متن کامل

Partial permutation decoding for codes from finite planes

We determine to what extent permutation decoding can be used for the codes from desarguesian projective and affine planes. We define the notion of s-PD-sets to correct s errors, and construct some specific small sets for s = 2 and 3 for desarguesian planes of prime order.

متن کامل

Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PGLDPC) codes, that are constructed based on the projective planes PG(2, q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding an...

متن کامل

On the (dual) code generated by the incidence matrix of points and hyperplanes in PG(n, q)

In this paper, we study the p-ary linear code C(PG(n, q)), q = p, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2008